A direct verification argument for the Hamilton–Jacobi equation continuum limit of nondominated sorting
نویسندگان
چکیده
منابع مشابه
A direct verification argument for the Hamilton-Jacobi equation continuum limit of nondominated sorting
Nondominated sorting is a combinatorial algorithm that sorts points in Euclidean space into layers according to a partial order. It was recently shown that nondominated sorting of random points has a Hamilton-Jacobi equation continuum limit. The original proof, given in [1], relies on a continuum variational problem. In this paper, we give a new proof using a direct verification argument that c...
متن کاملA Hamilton-Jacobi Equation for the Continuum Limit of Nondominated Sorting
105 points 106 points Application: Polynuclear growth Random model for layer by layer growth [1] 1. Initially a flat crystal in contact with supersaturated vapor. 2. At a random later time, a supercritical nucleus forms, and spreads laterally via attachment of particles at the perimeter. 3. New layers are randomly nucleated upon existing layers. 4. When islands within the same layer collide, th...
متن کاملAn Improved Nondominated Sorting Algorithm
This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with m objective functions, using n solutions in the population, the original nondominated sorting algorithm, used ...
متن کاملA PDE-based Approach to Nondominated Sorting
Nondominated sorting is a fundamental combinatorial problem in multiobjective optimization and is equivalent to the longest chain problem in combinatorics and random growth models for crystals in materials science. In a previous work [SIAM J. Math. Anal., 46 (2014), pp. 603–638], we showed that nondominated sorting has a continuum limit that corresponds to solving a Hamilton–Jacobi equation. In...
متن کاملA Nondominated Sorting Genetic Algorithm for Shortest Path Routing Problem
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Analysis: Theory, Methods & Applications
سال: 2016
ISSN: 0362-546X
DOI: 10.1016/j.na.2016.03.023